In a namespace called Lab5, write C# classes called RootedBinaryTree and Compressor using the supplied code stub.
The huffman method should accept an array of Word objects with the plainWord and probability fields filled in, and return the same array with the codeWord fields also filled in according to Huffman's Algorithm. In implementing Huffman's Algorithm, make use of the RootedBinaryTree class. Note that RootedBinaryTree should perform shallow copying to reduce the time- and space-complexity of tree operations.